Self-interested Planning Agents using Plan Repair
نویسندگان
چکیده
We present a novel approach to multiagent planning for selfinterested agents. The main idea behind our approach is that multiagent planning systems should be built upon (singleagent) plan repair systems. In our system agents can exchange goals and subgoals through an auction, using their own heuristics or utility functions to determine when to auction and what to bid. Some experimental results for a logistics domain demonstrate empirically that this system supports the coordination of self-interested agents.
منابع مشابه
Coordination through Plan Repair
In most application domains for distributed arti cial intelligence, several autonomous agents (e.g., companies or personal assistants) each have their own goals. They need to plan for these goals, coordinate their actions, deal with uncertainty, and interleave all this with plan execution [2, 4]. To complicate matters even more, many agents are self-interested and require some privacy concernin...
متن کاملA Mechanism of Generating Joint Plans for Self-interested Agents, and by the Agents
Generating joint plans for multiple self-interested agents is one of the most challenging problems in AI, since complications arise when each agent brings into a multi-agent system its personal abilities and utilities. Some fully centralized approaches (which require agents to fully reveal their private information) have been proposed for the plan synthesis problem in the literature. However, i...
متن کاملThesis Proposal - Planning Games
This paper provides a proposal for a thesis on plan generation in multiagent planning domains with self-interested agents. The research area involves Coalition-Planning Games in which agents are trying to maximise their own utility but can enter into unbreakable deals with other agents. The goal of the research is to provide algorithms for agents to generate plans that form stable solutions.
متن کاملHeuristic multiagent planning with self-interested agents
The focus of multiagent planning research has recently turned towards domains with self-interested agents leading to the definition of Coalition–Planning Games (CoPGs). In this paper, we investigate algorithms for solving a restricted class of “safe” CoPGs, in which no agent can benefit from making another agent’s plan invalid. We introduce a novel, generalised solution concept, and show how pr...
متن کاملDecomposition in Task Based Multi-Agent Planning Systems
We discuss a general framework for coordinating self-interested agents in the pre-planning phase that can be used to decompose multi-agent task based planning problems into independent subproblems. The decomposition allows the agents to solve their part of the problem without the need to interact with other agents and such that the resulting plans can be easily combined into a joint plan. We il...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005